Maximal dimensional partially ordered sets I. Hiraguchi's theorem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tripled partially ordered sets

In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.

متن کامل

Shortcuts, diversions, and maximal chainsin partially ordered sets

An algorithm is described for finding the maximal weight chain between two points in a locally finite partial order under the restriction that all but • (or fewer) successive pairs in the chain belong to a given subset of the partial order relation. Applications of the method in molecular genetics, critical path scheduling, and other fields are discussed. Let P be a set with two locally finite ...

متن کامل

Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension n

In this paper, we show that if a partially ordered set has 2n elements and has dimension n, then it is isosnorphic to the set of n-l element subsets and lelement subsets of a sef, ordered by inclusion, or else it has six elements and is isomorphic to a partially ordered b;i we call the chevron or to its dual.

متن کامل

Maximal dimensional partially ordered sets III: a characterization of Hiraguchi's inequality for interval dimension

Dushnik and Mikr detirw tht: dimension of a partially crderc-d set X, denoted dim X, as the smallest positive integLi f for whkh thckre exist t linear estcnsions of X whose inter-saztion is the partial ordertng OF A'. Hiraguchi proved that ifr-t 2 2 and 1x1 G 2rt + 1, then dim X Q. n. dogart, Trotter and Kim& have gsven a forbidden c-• bposet characteriza?ion of Htraguchi " s Inequality by dete...

متن کامل

A Theorem on Partially Ordered Sets of Order-preserving Mappings

Let P be a partially ordered set and let Pp denote the set of all order-preserving mappings of P to P ordered by/ < g in Pp iif(p) < g(p) for all p £ P. We prove that if P and Q are finite, connected partially ordered sets and Pp = Q<¡ then Psg. Is a partially ordered set determined by its order-preserving mappings? L. M. Gluskin [4] has shown that the set of order-preserving mappings of a part...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1973

ISSN: 0012-365X

DOI: 10.1016/0012-365x(73)90024-1